A characterization of cocircuit graphs of uniform oriented matroids

نویسندگان

  • Juan José Montellano-Ballesteros
  • Ricardo Strausz
چکیده

The cocircuit graph of an oriented matroid is the 1-skeleton of the cellular decomposition induced by the Topological Representation Theorem due to Folkman and Lawrence (1978) [J. Folkman, J. Lawrence, Oriented matroids, J. Combin. Theory Ser. B 25 (1978) 199–236]. In this paper we exhibit a characterization of such graphs (for the uniform case) via their natural embedding into Qn—the 1-skeleton of the n-cube’s k-skeleton’s dual complex. The main theorem reads, basically, as follows: A graph G is the cocircuit graph of a d-dimensional uniform oriented matroid on n elements if and only if its order is 2 ( n d+2 ) , and it can be embedded antipodally and “metrically” into Qn−d−2 n . © 2005 Elsevier Inc. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generation of Oriented Matroids - A Graph Theoretical Approach

We discuss methods for the generation of oriented matroids and of isomorphism classes of oriented matroids. Our methods are based on single element extensions and graph theoretical representations of oriented matroids, and all these methods work in general rank and for nonuniform and uniform oriented matroids as well. We consider two types of graphs, cocircuit graphs and tope graphs, and discus...

متن کامل

Cubic time recognition of cocircuit graphs of uniform oriented matroids

We present an algorithm which takes a graph as input and decides in cubic time if the graph is the cocircuit graph of a uniform oriented matroid. In the affirmative case the algorithm returns the set of signed cocircuits of the oriented matroid. This improves an algorithm proposed by Babson, Finschi and Fukuda. Moreover we strengthen a result of Montellano-Ballesteros and Strausz about crabbed ...

متن کامل

On the Number of Circuit-cocircuit Reversal Classes of an Oriented Matroid

Gioan introduced the circuit-cocircuit reversal system of an oriented matroid and showed that its cardinality equals the number of bases when the underlying matroid is regular. We prove that the equality fails whenever the underlying matroid is not regular, hence giving a new characterization of regular matroids.

متن کامل

On the Circuit-cocircuit Intersection Conjecture

Oxley has conjectured that for k ≥ 4, if a matroidM has a k-element set that is the intersection of a circuit and a cocircuit, thenM has a (k− 2)-element set that is the intersection of a circuit and a cocircuit. In this paper we prove a stronger version of this conjecture for regular matroids. We also show that the stronger result does not hold for binary matroids.

متن کامل

Polynomial Time Recognition of Uniform Cocircuit Graphs

We present an algorithm which takes a graph as input and decides in polynomial time if the graph is the cocircuit graph of a uniform oriented matroid. In the affirmative case the algorithm returns the set of signed cocircuits of the oriented matroid.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Comb. Theory, Ser. B

دوره 96  شماره 

صفحات  -

تاریخ انتشار 2006